FUNCTION CHAINS FROM UNIFORM SIGMA-1-1 WELL ORDERS
نویسندگان
چکیده
منابع مشابه
Superstring sigma models from spin chains : the SU ( 1 , 1 | 1 ) case
We derive the coherent state representation of the integrable spin chain Hamil-tonian with non-compact supersymmetry group G =SU(1, 1|1). By passing to the continuous limit, we find a spin chain sigma model describing a string moving on the supercoset G/H, H being the stabilizer group. The action is written in a manifestly G-invariant form in terms of the Cartan forms and the string coordinates...
متن کاملAfobazole modulates microglial function via activation of both sigma-1 and sigma-2 receptors.
Microglial cells play a critical role in the neuroinflammatory response that accompanies various diseases of the central nervous system, such as ischemic stroke, and ATP is a major signaling molecule regulating the response of these cells to these pathophysiological conditions. Experiments were carried out to determine the effects of afobazole on microglial function and to identify the molecula...
متن کاملWell - Quasi - Orders Christian
Based on Isabelle/HOL’s type class for preorders, we introduce a type class for well-quasi-orders (wqo) which is characterized by the absence of “bad” sequences (our proofs are along the lines of the proof of Nash-Williams [1], from which we also borrow terminology). Our main results are instantiations for the product type, the list type, and a type of finite trees, which (almost) directly foll...
متن کاملWell-Quasi-Orders
Based on Isabelle/HOL’s type class for preorders, we introduce a type class for well-quasi-orders (wqo) which is characterized by the absence of “bad” sequences (our proofs are along the lines of the proof of Nash-Williams [1], from which we also borrow terminology). Our main results are instantiations for the product type, the list type, and a type of finite trees, which (almost) directly foll...
متن کاملUnambiguous 1-uniform morphisms
If, for a morphism σ : ∆∗ → Σ∗ (where ∆ and Σ are arbitrary alphabets) and a word α ∈ ∆∗, there exists another morphism τ mapping α to σ(α), then σ is called ambiguous with respect to α ; if such a τ does not exist, then σ is unambiguous. For example, the morphism σ0 : {A,B,C}∗ → {a,b}∗ – given by σ0(A) := a, σ0(B) := a, σ0(C) := b – is ambiguous with respect to the word α0 := ABCACB, since the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pure and Apllied Mathematics
سال: 2014
ISSN: 1311-8080,1314-3395
DOI: 10.12732/ijpam.v93i5.7